# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def minimumRefill(self, plants: List[int], capacityA: int, capacityB: int) -> int:
        alice_index = 0
        bob_index = len(plants) - 1

        ans = 0
        alice_water = capacityA
        bob_water = capacityB

        while alice_index < bob_index:
            if alice_water < plants[alice_index]:
                alice_water = capacityA - plants[alice_index]
                ans += 1
            else:
                alice_water = alice_water - plants[alice_index]

            if bob_water < plants[bob_index]:
                bob_water = capacityB - plants[bob_index]
                ans += 1
            else:
                bob_water = bob_water - plants[bob_index]

            alice_index += 1
            bob_index -= 1

        if alice_index == bob_index:
            max_water = max(alice_water, bob_water)
            if max_water < plants[alice_index]:
                ans += 1

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([2, 2, 3, 3], 5, 3, 1),
        ([2, 2, 3, 3], 3, 4, 2),
        ([5], 10, 8, 0)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]
        input3 = case_item[2]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.minimumRefill(input1, input2, input3)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)
